Learning LBP structure by maximizing the conditional mutual information
نویسندگان
چکیده
Local binary patterns of more bits extracted in a large structure have shown promising results in visual recognition applications. This results in very highdimensional data so that it is not feasible to directly extract features from the LBP histogram, especially for a large-scale database. Instead of extracting features from the LBP histogram, we propose a new approach to learn discriminative LBP structures for a specific application. Our objective is to select an optimal subset of binarized-pixel-difference features to compose the LBP structure. As these features are strongly correlated, conventional feature-selection methods may not yield a desirable performance. Thus, we propose an incremental Maximal-Conditional-Mutual-Information scheme for LBP structure learning. The proposed approach has demonstrated a superior performance over the state-of-the-arts results on classifying both spatial patterns such as texture classification, scene recognition and face recognition, and spatial-temporal patterns such as dynamic texture recognition.
منابع مشابه
Conditional Mutual Information Based Boosting for Facial Expression Recognition
This paper proposes a novel approach for facial expression recognition by boosting Local Binary Patterns (LBP) based classifiers. Low-cost LBP features are introduced to effectively describle local features of face images. A novel learning procedure, Conditional Mutual Information based Boosting (CMIB), is proposed. CMIB learns a sequence of weak classifiers that maximize their mutual informati...
متن کاملConditional Mutual Infomation Based Boosting for Facial Expression Recognition
This paper proposes a novel approach for facial expression recognition by boosting Local Binary Patterns (LBP) based classifiers. Low-cost LBP features are introduced to effectively describle local features of face images. A novel learning procedure, Conditional Mutual Infomation based Boosting (CMIB), is proposed. CMIB learns a sequence of weak classifiers that maximize their mutual informatio...
متن کاملConditional Information Bottleneck Clustering
We present an extension of the well-known information bottleneck framework, called conditional information bottleneck, which takes negative relevance information into account by maximizing a conditional mutual information score. This general approach can be utilized in a data mining context to extract relevant information that is at the same time novel relative to known properties or structures...
متن کاملLearning Tree Conditional Random Fields
We examine maximum spanning tree-based methods for learning the structure of tree Conditional Random Fields (CRFs) P (Y|X ). We use edge weights which take advantage of local inputs X and thus scale to large problems. For a general class of edge weights, we give a negative learnability result. However, we demonstrate that two members of the class–local Conditional Mutual Information and Decompo...
متن کاملActive Learning for Hidden Attributes in Networks
In many networks, vertices have hidden attributes, or types, that are correlated with the networks topology. If the topology is known but these attributes are not, and if learning the attributes is costly, we need a method for choosing which vertex to query in order to learn as much as possible about the attributes of the other vertices. We assume the network is generated by a stochastic block ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Pattern Recognition
دوره 48 شماره
صفحات -
تاریخ انتشار 2015